A Constraint Programming Approach for Workflow Applications
نویسندگان
چکیده
This paper proposes a constraint programming approach for workflow applications in which a slip is regarded as a tuple of the RDB model. A workflow is considered to be a series of database updating and constraint maintenance processes in this case. The proposed method utilizes pre-conditions and postconditions in a constraint programming style for an agent that interprets and executes these constraints. The method has been experimentally applied to a real application and the following advantages have been confirmed: (1) No programming for opposite directional flow to correct the value of an erroneous item when an error is detected in the workflow downstream stage, and (2) Small semantic gap between the domain knowledge and the declarative programming description. Topics : Knowledge-based methods and tools for software engineering
منابع مشابه
Score Based Budget Constraint Workflow Scheduling Algorithm for Cloud System
Cloud Computing is the technology that provides on demand services and resources like storage space, networks, programming language execution environment on the top of Internet using pay as you go model. The concept of Cloud Computing emerging as a latest model of service provisioning in distributed system encourage researchers to investigate its advantages and drawbacks in executing scientific...
متن کاملAn approach for the high-level specification of QoS-aware grid workflows considering location affinity
Many important scientific and engineering problems may be solved by combining multiple applications in the form of a Grid workflow. We consider that for the wide acceptance of Grid technology it is important that the user has the possibility to express requirements on Quality of Service (QoS) at workflow specification time. However, most of the existing workflow languages lack constructs for Qo...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملSolving Fractional Programming Problems based on Swarm Intelligence
This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to s...
متن کاملDiagnosing correctness of semantic workflow models
To model operational business processes in an accurate way, workflow models need to reference both the control flow and dataflow perspectives. Checking the correctness of such workflow models and giving precise feedback in case of errors is challenging due to the interplay between these different perspectives. In this paper, we propose a fully automated approach for diagnosing correctness of se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998